Infinite primitive directed graphs
نویسندگان
چکیده
منابع مشابه
Infinite primitive directed graphs
A group G of permutations of a set is primitive if it acts transitively on , and the only G-invariant equivalence relations on are the trivial and universal relations. A digraph is primitive if its automorphism group acts primitively on its vertex set, and is infinite if its vertex set is infinite. It has connectivity one if it is connected and there exists a vertex α of , such that the induced...
متن کامل6 Infinite Primitive Directed Graphs
A group G of permutations of a set Ω is primitive if it acts transitively on Ω, and the only G-invariant equivalence relations on Ω are the trivial and universal relations. A graph Γ is primitive if its automorphism group acts primitively on its vertex set. A graph Γ has connectivity one if it is connected and there exists a vertex α of Γ, such that the induced graph Γ \ {α} is not connected. I...
متن کاملIndependent domination in directed graphs
In this paper we initialize the study of independent domination in directed graphs. We show that an independent dominating set of an orientation of a graph is also an independent dominating set of the underlying graph, but that the converse is not true in general. We then prove existence and uniqueness theorems for several classes of digraphs including orientations of complete graphs, paths, tr...
متن کاملInfinite Primitive Groups.
We give a complete characterization of finitely generated primitive groups in several settings including linear groups, subgroups of mapping class groups, groups acting minimally on trees and convergence groups. The latter category includes as a special case Kleinian groups as well as finitely generated subgroups of word hyperbolic groups. As an application we calculate the Frattini subgroup in...
متن کاملOn Infinite-finite Duality Pairs of Directed Graphs
The (A,D) duality pairs play crucial role in the theory of general relational structures and in the Constraint Satisfaction Problem. The case where both classes are finite is fully characterized. The case when both side are infinite seems to be very complex. It is also known that no finite-infinite duality pair is possible if we make the additional restriction that both classes are antichains. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebraic Combinatorics
سال: 2009
ISSN: 0925-9899,1572-9192
DOI: 10.1007/s10801-009-0190-3